Algebraic Description of Derivational Minimalism
نویسندگان
چکیده
In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple contextfree grammar (MCFG). By viewing MCFG rules as terms in a free Lawvere theory we can translate a given MCFG into a regular tree grammar. The latter is characterizable by both a tree automaton and a corresponding formula in monadic second-order (MSO) logic. The trees of the resulting regular tree language are then unpacked into the intended “linguistic” trees with an MSO transduction based upon tree-walking automata. This two-step approach gives an operational as well as a logical description of the tree sets involved.
منابع مشابه
A Description of Derivational Affixes in Sarhaddi Balochi of Granchin
Sarhaddi Balochi dialect, a language variety of Western (Rakhshani) Balochi, employs derivation through affixation as one of its word formation processes. The purpose of this article is to present a synchronic description of the way(s) different derivational affixes function in making complex words in Sarhaddi Balochi as spoken in Granchin[1] district located about 35Kms to the southeast of Kha...
متن کاملObservations on Strict Derivational Minimalism
Deviating from the definition originally presented in [12], Stabler [13] introduced— inspired by some recent proposals in terms of a minimalist approach to transformational syntax—a (revised) type of a minimalist grammar (MG) as well as a certain type of a strict minimalist grammar (SMG). These two types can be shown to determine the same class of derivable string languages.
متن کاملDerivational minimalism in two regular and logical steps
In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple contextfree grammar (MCFG). By viewing MCFG rules as terms in a free Lawvere theory we can translate a given MCFG into a regular tree grammar. The latter is characterizable by both a tree automaton and a corresponding for...
متن کاملWell-Nestedness Properly Subsumes Strict Derivational Minimalism
Minimalist grammars (MGs) constitute a mildly contextsensitive formalism when being equipped with a particular locality condition (LC), the shortest move condition. In this format MGs define the same class of derivable string languages as multiple context-free grammars (MCFGs). Adding another LC to MGs, the specifier island condition (SPIC), results in a proper subclass of derivable languages. ...
متن کامل